A randomized roadmap method for path and manipulation planning
نویسندگان
چکیده
This paper presents a new randomized roadmap method for motion planning for many dof robots that can be used to obtain high quality roadmaps even when C-space is crowded. The main novelty in our approach is that roadmap candidate points are chosen on C-obstacle surfaces. As a consequence, the roadmap is likely to contain difficult paths, such as those traversing long, narrow passages in C-space. The approach can be used for both collision-free path planning and for manipulation planning of contact tasks. Experimental results with a planar articulated 6 dof robot show that, after preprocessing, difficult path planning operations can often be carried out in less than a second.
منابع مشابه
A Probabilistic Roadmap Approach for Systems with Closed
W e present a randomized approach t o path planning f o r articulated robots that have closed kinematic chains. The approach extends the probabilistic roadmap technique which has previously been applied t o rigid and elastic objects, and articulated robots without closed chains. Our work provides a framework f o r path planning problems that m u s t satisfy closure constraints in addition t o s...
متن کاملDeformable Volumes in Path Planning Applications
This paper addresses the problem of path planning for a class of deformable volumes under fairly general manipulation constraints. The underlying geometric model for the volume is provided by a mass-spring representation. It is augmented by a realistic mechanical model. The latter permits the computation of the shape of the considered object with respect to the grasping constraints by minimizin...
متن کاملOBPRM: An Obstacle-Based PRM for 3D Workspaces
Recently, a new class of randomized path planning methods, known as Probabilistic Roadmap Methods (prms) have shown great potential for solving complicated high-dimensional problems. prms use randomization (usually during preprocessing) to construct a graph of representative paths in C-space (a roadmap) whose vertices correspond to collision-free con gurations of the robot and in which two vert...
متن کاملGeneric Motion Planner for Robot Multi-fingered Manipulation
This paper addresses the dexterous manipulation-planning problem, which deals with motion planning for multi-fingered hand manipulating objects among static obstacles, under quasi-static movement assumption. We propose a general manipulation approach capable to compute object and finger trajectories as well as the finger relocation sequence, in order to link any two given configurations of the ...
متن کاملA Generic Motion Planner for Robot Multi-fingered Manipulation
This paper addresses the dexterous manipulation-planning problem, which deals with motion planning for multi-fingered hand manipulating objects among static obstacles, under quasi-static movement assumption. We propose a general manipulation approach capable to compute object and finger trajectories as well as the finger relocation sequence, in order to link any two given configurations of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996